Dining Cryptographers with 0.924 Verifiable Collision Resolution

The dining cryptographers protocol implements a multiple access channel in which senders and recipients are anonymous. A problem is that a malicious participant can disrupt communication by deliberately creating collisions. We propose a computationally secure dining cryptographers protocol with collision resolution that achieves a maximum stable throughput of 0.924 messages per round and which allows to easily detect disruptors.Comment: 11 pages, 3 figure

Iterative Decoding of Trellis-Constrained Codes inspired by Amplitude Amplification (Preliminary Version)

We propose a decoder for Trellis-Constrained Codes, a super-class of Turbo- and LDPC codes. Inspired by amplitude amplification from quantum computing, we attempt to amplify the relative likelihood of the most likely codeword until it stands out from all other codewords

Characterization of domain walls in BaTiO3 using simultaneous atomic force and piezo response force microscopy

In this letter a method to simultaneously measure the physical and the polarization thickness of a 90° domain wall in a ferroelectric perovskite is presented. This method combines accurate atomic force microscopy and piezoresponse force microscopy scans of the same area with little drift and an analysis of the entire scanned area. It is found that the physical thickness is significantly narrower (about seven and a half times) than the polarization thickness in a 90° domain wall in BaTiO3. Evidence of the trapping of defects at such domain walls is also found

Dining Cryptographers are Practical

The dining cryptographers protocol provides information-theoretically secure sender and recipient untraceability. However, the protocol is considered to be impractical because a malicious participant may disrupt the communication. We propose an implementation which provides information-theoretical security for senders and recipients, and in which a disruptor with limited computational capabilities can easily be detected.Comment: 12 page